Universal and special keys based on phase-truncated Fourier transform
نویسندگان
چکیده
منابع مشابه
Notes on the Truncated Fourier Transform
In a previous paper [vdH04], we introduced a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the “jumps” in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, a non-trivial asymptotic factor was gained with...
متن کاملThe Truncated Fourier Transform andApplicationsJoris
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminating the jumpss in the complexity at powers of two. When applied to the multiplication of multivariate polynomials or truncated multivariate power series, we gain a logarithmic factor with respect to the best previously ...
متن کاملPolynomial Phase Estimation Based on Adaptive Short-Time Fourier Transform
Polynomial phase signals (PPSs) have numerous applications in many fields including radar, sonar, geophysics, and radio communication systems. Therefore, estimation of PPS coefficients is very important. In this paper, a novel approach for PPS parameters estimation based on adaptive short-time Fourier transform (ASTFT), called the PPS-ASTFT estimator, is proposed. Using the PPS-ASTFT estimator,...
متن کاملHuman Activity Recognition Based on Transform and Fourier Mellin Transform
Human activity recognition is attracting a lot of attention in the computer vision domain. In this paper we present a novel human activity recognition method based on transform and Fourier Mellin Transform (FMT). Firstly, we convert the original image sequence to the Radon domain, get the transform curves by transform. Then we extract the Rotation-Scaling-Translation (RST) invariant features by...
متن کاملAn Illustrated Introduction to the Truncated Fourier Transform
The Truncated Fourier Transform (tft) is a variation of the Discrete Fourier Transform (dft/fft) that allows for input vectors that do not have length 2 n for n a positive integer. We present the univariate version of the tft, originally due to Joris van der Hoeven, heavily illustrating the presentation in order to make these methods accessible to a broader audience.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optical Engineering
سال: 2011
ISSN: 0091-3286
DOI: 10.1117/1.3607421